5th International Workshop on Proof, Computation, Complexity Pcc '06

Mathias Barra On some small subrecursive hierarchies . . . . . . . . . . . . . . . . 7 Ulrich Berger Strong normalisation via domain-theoretic computability predicates 9 Guillaume Bonfante Life after “life without cons” . . . . . . . . . . . . . . . . . . . . . 10 Michael Brinkmeier Terms and Operads . . . . . . . . . . . . . . . . . . . . . . . . . . 15 Folke Eisterlehner An alternative correctness proof of a certification method for fptime 18 Marco Gaboardi λ-Calculus and Soft Linear Logic . . . . . . . . . . . . . . . . . . . 20 Lew Gordeev Strong WQO phase transitions . . . . . . . . . . . . . . . . . . . . 24 Lars Kristiansen T −-Hierarchies and the Trade-off Theorem . . . . . . . . . . . . . 28 Oliver Kullmann Sign-sensitive Graph Representations of CNFs: Conflict graphs and resolution graphs . . . . . . . . . . . . . . . . . . . . . . . . . 30 Jean-Yves Marion Interpretations methods for proving complexity upper bounds . . . 33 Jean-Yves Moyen Resources Control Graphs . . . . . . . . . . . . . . . . . . . . . . . 37 Gerard Renardel de Lavalette Interpolation in Horn logic . . . . . . . . . . . . . . . . . . . . . . 42 Henning Wunderlich Implicit characterizations of FPTIME and NC revisited . . . . . . 47 Ernst Zimmermann Substructural Logics in Natural Deduction . . . . . . . . . . . . . . 52 Preliminary Program 56 Proof, Computation, Complexity 06 On some small subrecursive hierarchies